Dictionary-Symbolwise Flexible Parsing

Optimal Parsing in Dictionary-Symbolwise Data Compression Schemes

In this paper we introduce dictionary-symbolwise data compression schemes. We describe a method that, under some natural hypothesis, allows to obtain an optimal parse of any input or of any part of an input. This method can also be used to approximate the optimal parse in the general case and, under some additional hypothesis, it gives rise to on-line data compression algorithms. Therefore it c...

On Dictionary-Symbolwise Data Compression

Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression

We report on the implementation and performance evaluation of greedy parsing with lookaheads for dynamic dictionary compression Speci cally we consider the greedy parsing with a single step lookahead which we call Flexible Parsing FP as an alternative to the commonly used greedy parsing with no lookaheads scheme Greedy parsing is the basis of most popular com pression programs including unix co...

Creating And Querying Lexical Data Bases

Users of computerized dictionaries require powerful and flexible tools for analyzing and manipulating the information in them. This paper discusses a system for grammatically describing and parsing entries from machine-readable dictionary tapes and a lexicai data base representation for storing the dictionary information. It also describes a language for querying, formatting, and maintaining di...

Learning Visual Symbols for Parsing Human Poses in Images

Parsing human poses in images is fundamental in extracting critical visual information for artificial intelligent agents. Our goal is to learn selfcontained body part representations from images, which we call visual symbols, and their symbolwise geometric contexts in this parsing process. Each symbol is individually learned by categorizing visual features leveraged by geometric information. In...